Rendezvous Search with Revealed Information: Applications to the Line
نویسنده
چکیده
The symmetric rendezvous problem on a network Q asks how two players, forced to use the same mixed strategy, can minimize their expected meeting time, starting from a known initial distribution on the nodes of Q: This minimum is called the (symmetric) rendezvous valueof Q: Traditionally, the players are assumed to receive no information during the play of the game. We consider the e¤ect on rendezvous times of giving the players some information about past actions and chance moves, enabling them to apply Bayesian updates to improve their knowledge of their partners whereabouts. We consider the case where they are placed a known distance apart on the line graph Q (symmetric rendezvous on the line). These techniques can be used to give lower bounds on the rendezvous times of the original game (without any revealed information). Our approach is to concentrate on a general analysis of the e¤ect of revelations, rather than compute the best bounds possible with our techniques. MSC 2000: 90B40 Search theory keywords: rendezvous, search, common interest games, team theory
منابع مشابه
Rendezvous Search with Revealed Information: Applications to the Line
The symmetric rendezvous problem on a network Q asks how two players, forced to use the same mixed strategy, can minimize their expected meeting time, starting from a known initial distribution on the nodes of Q. This minimum is called the (symmetric) ‘rendezvous value’ofQ. Traditionally, the players are assumed to receive no information while playing the game. We consider the effect on rendezv...
متن کاملSymmetric Rendezvous Search on the Line using Move Patterns with Different Lengths
The player-symmetric rendezvous search problem on the line is considered. We introduce a new way to define mixed (randomized) strategies, and formalize a general scheme to compute the expected rendezvous time of mixed strategies. We introduce a strategy that has the following properties: (1) move patterns have different lengths, and (2) the probability of choosing a move pattern in the current ...
متن کاملSearch-and-Rescue Rendezvous
We consider a new type of asymmetric rendezvous search problem in which Agent II needs to give Agent I a ‘gift’ which can be in the form of information or material. The gift can either be transfered upon meeting, as in traditional rendezvous, or it can be dropped off by II at a location he passes, in the hope it will be found by I. The gift might be a water bottle for a traveller lost in the de...
متن کاملIdentification of the underlying factors affecting information seeking behavior of users interacting with the visual search option in EBSCO: a grounded theory study
Background and Aim: Information seeking is interactive behavior of searcher with information systems and this active interaction occurs in a real environment known as background or context. This study investigated the factors influencing the formation of layers of context and their impact on the interaction of the user with search option dialoge in EBSCO database. Method: Data from 28 semi-stru...
متن کاملDistributed Search with Rendezvous Search Systems
The ever-growing amount of data made available through the Internet requires powerful and highly scalable search systems. Not only the mostly unstructured data but also the increasing user expectations demand for sophisticated and flexible search primitives like keyword search or XPath. Academic research on peer-to-peer networks has been mostly focused on how to build such advanced primitives o...
متن کامل